Reducing Network Overhead with Common Junction Methodology

نویسندگان

  • Shashi Bhushan
  • Mayank Dave
  • R. B. Patel
چکیده

In structured and unstructured Peer-to-Peer (P2P) systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology (CJM) to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network. DOI: 10.4018/978-1-4666-2163-3.ch013

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Neighbor Coverage Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

Traditional routing protocols in Mobile Ad hoc Network (MANET) send periodic messages to realize the changes in topology. Sending periodic messages cause overhead. Compared to proactive routing protocols, reactive routing protocols can cause less overhead. Broadcasting can cause broadcast storm problem .To discover the route better than broadcasting methodology rebroadcast can done with the hel...

متن کامل

Network Parameters Evaluation in Vehicular Ad-hoc Network (VANET) Routing Protocols for Efficient Message Delivery in City Environment

Abstract- Efficient message delivery in city environment is required to ensure driver’s safety and passenger’s comfortability. In cities of developed nations, routing of data in vehicular Ad hoc Network (VANET) faces many challenges such as radio obstacles, mobility constraints and uneven nodes distribution. These factors primarily makes communication between vehicles complex. To overcome and t...

متن کامل

An Overhead Reducing Technique for Time Warp

This paper introduces a technique that reduces the number of state savings and the maximum memory needed for the Time Warp. We present a technique to determine if an event is safe or not. If an event execution is safe, no state saving is carried out. The technique discards some saved states even though the time stamps are larger than the GVT. We prove that the technique is correct under both ag...

متن کامل

A Current Shaping Methodology for Low EMI Asynchronous Circuits

The paper describes a design methodology for reducing current peaks in asynchronous digital circuits. Two existing methods influence this methodology, which deals with circuits at the architecture level. It spreads the current activity inside the circuit by controlling communication delays and events scheduling. A 4-taps FIR filter, synthesized in a 0.18μm CMOS technology, proves the methodolog...

متن کامل

Neural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree

In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJMCMC

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2011